Duality theory and slackness conditions in multiobjective linear programming

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimality Conditions and Duality in Multiobjective Programming with Invexity*

( , ) ρ Φ − invexity has recently been introduced with the intent of generalizing invex functions in mathematical programming. Using such conditions we obtain new sufficiency results for optimality in multiobjective programming and extend some classical duality properties.

متن کامل

Duality Theory for Interval Linear Programming Problems

We define the primal and dual linear programming problems involving interval numbers as the way of traditional linear programming problems. We discuss the solution concepts of primal and dual linear programming problems involving interval numbers without converting them to classical linear programming problems. By introducing new arithmetic operations between interval numbers, we prove the weak...

متن کامل

Some Duality Results in Grey Linear Programming Problem

Different approaches are presented to address the uncertainty of data and appropriate description of uncertain parameters of linear programming models. One of them is to use the grey systems theory in modeling such problem. Especially, recently, grey linear programming has attracted many researchers. In this paper, a kind of linear programming with grey coefficients is discussed. Introducing th...

متن کامل

On Linear Programming Duality and Necessary and Sufficient Conditions in Minimax Theory

In this paper we discuss necessary and sufficient conditions for different minimax results to hold using only linear programming duality and the finite intersection property for compact sets. It turns out that these necessary and sufficient conditions have a clear interpretation within zero-sum game theory. We apply these results to derive necessary and sufficient conditions for strong duality ...

متن کامل

Second Order Duality in Multiobjective Programming

A nonlinear multiobjective programming problem is considered. Weak, strong and strict converse duality theorems are established under generalized second order (F, α, ρ, d)-convexity for second order Mangasarian type and general Mond-Weir type vector duals.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 1999

ISSN: 0898-1221

DOI: 10.1016/s0898-1221(99)00062-0